A hybrid network flow tabu search heuristic for the minimum shift design problem
نویسندگان
چکیده
The minimum shift design problem (MSD) is a scheduling problem that commonly arises in workforce management activities. Given a collection of shifts and workforce requirements, the problem consists in finding a minimum cardinality set of work shifts, and the number of workers to assign to each shift, in order to meet (or minimize the deviation from) prespecified staff requirements. This problem reduces to a special case of the minimum edge-cost flow problem (MECF ) for which a logarithmic hardness of approximation lower bound can be shown. We propose a two-stage heuristic for MSD . The first stage, inspired by the relation between the MSD and MECF problems, is based on a greedy heuristic that relies on a mincost max-flow (MCMF ) subroutine. The second stage is a composite tabu search procedure based on the interleaving of different neighborhood definitions. We compare our heuristic with
منابع مشابه
Solving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of pro...
متن کاملSimultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts
Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...
متن کاملA Hybrid Meta-heuristic Method for Multimodal Logistics Network Design over Planning Horizon
Logistics optimization has been acknowledged increasingly as a key issue of supply chain management to improve the business efficiency under global competition and diversified customer demands. Concerning a multimodal logistics optimization problem under multiperiods, in this paper, we have extended a method termed hybrid tabu search that was developed previously by the authors. The attempt aim...
متن کاملThe minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize the deviation from workforce requirements. Our research considers both theoretical and practical aspects of the min-SHIFT DESIGN problem. This pro...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کامل